RAL 95 - 026 On approximate - inverse preconditioners
نویسنده
چکیده
We investigate the use of sparse approximate-inverse preconditioners for the iterative solution of unsymmetric linear systems of equations. Such methods are of particular interest because of the considerable scope for parallelization. We propose a number of enhancements which may improve their performance. When run in a sequential environment, these methods can perform unfavourably when compared with other techniques. However, they can be successful when other methods fail and simulations indicate that they can be competitive when considered in a parallel environment. 1 Current reports available by anonymous ftp from joyous-gard.cc.rl.ac.uk (internet 130.246.9.91) in the directory “pub/reports”. Computing and Information Systems Department, Atlas Centre, Rutherford Appleton Laboratory, Oxfordshire OX11 0QX, England.
منابع مشابه
ILU and IUL factorizations obtained from forward and backward factored approximate inverse algorithms
In this paper, an efficient dropping criterion has been used to compute the IUL factorization obtained from Backward Factored APproximate INVerse (BFAPINV) and ILU factorization obtained from Forward Factored APproximate INVerse (FFAPINV) algorithms. We use different drop tolerance parameters to compute the preconditioners. To study the effect of such a dropping on the quality of the ILU ...
متن کاملApproximate Inverse Preconditioners for Some Large Dense Random Electrostatic Interaction Matrices
A sparse mesh-neighbour based approximate inverse preconditioner is proposed for a type of dense matrices whose entries come from the evaluation of a slowly decaying free space Green’s function at randomly placed points in a unit cell. By approximating distant potential fields originating at closely spaced sources in a certain way, the preconditioner is given properties similar to, or better th...
متن کاملSome Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods
In this paper, getting an high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners. These preconditioners are appropriate when the desired target is to maximize parallelism. Moreover, some theoretical results about these pre...
متن کاملAlmost optimal order approximate inverse based preconditioners for 3-d convection dominated problems on tensor-grids
For a one-dimensional diffusion problem on an refined computational grid we present preconditioners based on the standard approximate inverse technique. Next, we determine its spectral condition number κ2 and perform numerical calculations which corroborate the result. Then we perform numerical calculations which show that the standard approximate inverse preconditioners and our modified versio...
متن کاملApproximate Inverse Preconditioners for General Sparse Matrices
The standard Incomplete LU (ILU) preconditioners often fail for general sparse indeenite matrices because they give rise tòunstable' factors L and U. In such cases, it may be attractive to approximate the inverse of the matrix directly. This paper focuses on approximate inverse preconditioners based on minimizing kI?AMk F , where AM is the preconditioned matrix. An iterative descent-type method...
متن کامل